Quantum Zero-Error Algorithms Cannot be Composed
نویسندگان
چکیده
We exhibit two black-box problems, both of which have an efficient quantum algorithm with zero-error, yet whose composition does not have an efficient quantum algorithm with zero-error. This shows that quantum zero-error algorithms cannot be composed. In oracle terms, we give a relativized world where ZQP 6= ZQP, while classically we always have ZPP = ZPP.
منابع مشابه
Reducing Error Probability in Quantum Algorithms 1 Motivation and Statement of Results
We present several results related to quantum algorithms with very small error probability or even with zero-error. Firstly, we give a tight analysis of the trade-oos between the number of queries of quantum search algorithms, their error probability, the size of the search space, and the number of solutions in the search space. Secondly, we use this to show that a quantum computer cannot ampli...
متن کاملReducing Error Probability in Quantum Algorithms
We present several results related to quantum algorithms with very small error probability or even with zero-error. Firstly, we give a tight analysis of the trade-offs between the number of queries of quantum search algorithms, their error probability, the size of the search space, and the number of solutions in the search space. Secondly, we use this to show that a quantum computer cannot ampl...
متن کاملBounds for Small-Error and Zero-Error Quantum Algorithms
We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the number of queries of quantum search algorithms, their error probability, the size of the search space, and the number of solutions in this space. Using this, we deduce new lower and upper bounds for qu...
متن کاملOn exact counting and quasi-quantum complexity
We present characterisations of “exact” gap-definable classes, in terms of indeterministic models of computation which slightly modify the standard model of quantum computation. This follows on work of Aaronson [1], who shows that the counting class PP can be characterised in terms of bounded-error “quantum” algorithms which use invertible (and possibly non-unitary) transformations, or postsele...
متن کاملOn parallel composition of zero-knowledge proofs with black-box quantum simulators
Let L be a language decided by a constant-round quantum Arthur-Merlin (QAM) protocol with negligible soundness error and all but possibly the last message being classical. We prove that if this protocol is zero knowledge with a black-box, quantum simulator S, then L ∈ BQP. Our result also applies to any language having a three-round quantum interactive proof (QIP), with all but possibly the las...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 87 شماره
صفحات -
تاریخ انتشار 2003